系统可靠度的模糊分配

本文把模糊规划理论应用于系统可靠度的最优分配问题,给出两类常见的可靠度分配模型,并以实例说明解决此类问题的思想方法。     

带紧扰动的集值(S)_+型映射的拓扑度及其应用

本文利用 Michael 连续选择定理与 F.E Browder 次连续(S)_+型映射度理论相结合的方法,构造了带紧扰动的1.s.c.集值(S)_+型映射的拓扑度,并讨论了作为其应用的不动点与值域问题.     

The knapsack problem with a minimum filling constraint

We study a knapsack problem with an additional minimum filling constraint, such that the total weight of selected items cannot be less than a given threshold. The problem has several applications in shipping, e‐commerce, and transportation service procurement. When the threshold equals the knapsack capacity, even finding a feasible solution to the problem is NP‐hard. Therefore, we consider the case when the ratio α of threshold to capacity is less than 1. For this case, we develop an approximation scheme that returns a feasible solution with a total profit not less than (1 ‐ ε) times the total profit of an optimal solution for any ε > 0, and with a running time polynomial in the number of items, 1/ε, and 1/(1‐α). © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

一种统一的拓扑关系判断模型

拓扑关系是地理信息系统领域中一种非常重要的空间关系。当前已经提出了多种模型来对空间对象间的拓扑关系进行判断,但是这些模型都不能判断那些由点、线、多边形任意组合而成的异构几何集合对象间的拓扑关系。针对当前拓扑关系研究的不足,引入了混合几何的概念和正规化准则,基于此空间对象模型和维扩展9交集模型,提出了一个拓扑关系判断模型—集成型维扩展9交集模型(IDE 9IM),它不但能够判断单一的点、线、面以及同构几何集合对象间的拓扑关系,而且还能从复杂空间对象的总体和局部两个方面对异构几何集合对象间的拓扑关系进行判断,可以作为一个判断任意几何对象间拓扑关系的统一模型。     

无约束自由体有限元分析中的准静态法

在对某水下无约束航行体进行有限元静力分析的时候,由于无法限定结构的自由度而使刚度矩阵奇异,从而导致求解失败。为了解决这一问题,采用强迫约束法和准静态法(惯性释放)对此航行体进行了有限元静力对比计算,结果表明:用强迫约束法对水下航行体进行静力分析时,在施加强迫约束的部位出现了严重的应力集中现象,应力最大值为1.25×106Pa,应力集中使得整个结构的应力分布与实验数据相差较大,可认为计算结果错误;采用惯性释放法对其进行静力分析时,应力最大值为3.27×105Pa,整个结构的应力分布合理,与实验数据一致,计算结果正确。     

考虑落角约束与驾驶仪特性的自适应RBF空间末制导律

为使大口径舰炮制导炮弹在打击近岸机动目标的末制导段满足落角约束,现考虑自动驾驶仪动态特性,基于自适应RBF逼近网络与动态面滑模提出一种空间末制导律。构建空间弹目相对运动模型,通过带改进微分跟踪器的扩张状态观测器估计目标加速度。为零化视线角跟踪误差与视线角速率,采用自适应指数趋近律设计非奇异终端滑模动态面,并运用自适应RBF逼近网络削弱控制指令抖振。通过Lyapunov第二法证明了全系统中视线角跟踪误差与视线角速率均最终一致有界。仿真实验表明：该末制导律使制导炮弹在空间中打击具有不同机动形式的近岸目标时,均具备良好的末制导性能。     

内置式耐压液舱实肋板拓扑优化设计方案分析

通过对内置式耐压液舱中实肋板开孔拓扑优化设计后的强度和稳定性分析发现，对于周向范围为162°的内置式耐压液舱，实肋板在中内龙骨附近开孔较优。实肋板开孔后对于其本身的稳定性影响不大，但MISES应力会有所变化；实肋板开孔后，液舱结构的稳定性会稍微降低，后期在进行液舱结构设计时要考虑是否加强。     

考虑弹体动态特性的非奇异有限时间制导律

为满足导弹拦截机动目标时交会角约束和有限时间收敛的需求,建立了考虑弹体一阶动态特性的制导模型。把目标加速度视为有界外界干扰,同时结合非线性反步设计法中的动态面法,设计一种考虑弹体动态延迟的非奇异滑模制导律,并且证明了基于Lyapunov稳定性理论制导系统状态可渐进收敛到零。在所设计的制导律下,对单侧机动的低空高速目标进行仿真。仿真结果表明所设计的非奇异制导律可以有效降低弹体动态延迟带来的影响,而且具有较低的脱靶量与交会角误差;与考虑弹体动态特性和交会角约束的最优导引律相比,其具有更高的制导精度。     

Dynamic inventory control with limited capital and short‐term financing

For most firms, especially the small‐ and medium‐sized ones, the operational decisions are affected by their internal capital and ability to obtain external capital. However, the majority of the literature on dynamic inventory control ignores the firm's financial status and financing issues. An important question that arises is: what are the optimal inventory and financing policies for firms with limited internal capital and limited access to external capital? In this article, we study a dynamic inventory control problem where a capital‐constrained firm periodically purchases a product from a supplier and sells it to a market with random demands. In each period, the firm can use its own capital and/or borrow a short‐term loan to purchase the product, with the interest rate being nondecreasing in the loan size. The objective is to maximize the firm's expected terminal wealth at the end of the planning horizon. We show that the optimal inventory policy in each period is an equity‐level‐dependent base‐stock policy, where the equity level is the sum of the firm's capital level and the value of its on‐hand inventory evaluated at the purchasing cost; and the structure of the optimal policy can be characterized by four intervals of the equity level. Our results shed light on the dynamic inventory control for firms with limited capital and short‐term financing capabilities.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 184–201, 2014     

递归划分的标签约束可达性计算方法

现实世界中的图往往在结点和边上包含描述信息,可达性查询是图数据管理和挖掘中的基本操作之一。针对图数据中标签约束的可达性计算问题,提出一种基于递归划分的可达性计算方法 RP-Hop。该算法基于层次划分思想,利用独立集性质,在保持标签和可达性前提下对大规模图进行递归划分,并结合贪婪扩展思想和递归编码,为标签约束的可达性查询提供压缩索引。经过合成和真实数据集上的实验,结果表明,RP-Hop算法不仅降低了索引大小和构建时间,而且提高了查询效率。